Mapping and Inference in Analogical Problem Solving – As Much as Needed or as Much as Possible?
نویسندگان
چکیده
There exist many computational models of analogy making, which are based on different assumptions about the cognitive processes which are responsible for successful transfer from a base to a target domain. In most models, mapping of the base structure to the target is seen as the core of analogy making. We believe that the way in which this mapping is realized is a crucial aspect by which the different models can be distinguished. More specific, we identified systematic (as much as possible) versus pragmatic (as much as needed) approaches to mapping as critical assumption by which the computational models can be discerned. In case of pragmatic mapping, only such aspects of the base domain are carried over to the target which address the current focus of interest. In contrast, in case of systematic mapping, the greatest relational structure which contains the aligned parts of base and target is carried over. In consequence, in systematic approaches, many aspects of the target problem are inferred at one time and available for future use, while in pragmatic approaches new questions concerning the target domain may require that mapping and inference must be performed again. We conducted an experiment in the domain of physics to investigate which type of mapping is realized by human problem solvers and got significant evidence for systematic mapping.
منابع مشابه
Improving Source Selection in Analogical Reasoning An Interactionist Approach
The success of any analogical reasoner depends upon its ability to select a relevant source. We can improve source selection by more completely integrating the process of source retrieval with analogical inference, and by using experience in solving target problems to find properties that effectively predict a source’s relevance to future targets. This paper describes the design and evaluation ...
متن کاملAnalogical priming via semantic relations.
Research on semantic memory has often tacitly treated semantic relations as simple conduits for spreading activation between associated object concepts, rather than as integral components of semantic organization. Yet conceptual relations, and the role bindings they impose on the objects they relate, are central to such cognitive tasks as discourse comprehension, inference, problem solving, and...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملIntegrating analogical mapping and general problem solving: the path-mapping theory
This article describes the path-mapping theory of how humans integrate analogical mapping and general problem solving. The theory posits that humans represent analogs with declarative roles, map analogs by lower-level retrieval of analogous role paths, and coordinate mappings with higher-level organizational knowledge. Implemented in the ACT-R cognitive architecture, the path-mapping theory all...
متن کامل